Genetic parameters for faecal egg count, packed-cell volume and body-weight in Santa Inês lambs

Worm infection is one of the main factors responsible for economic losses in sheep breeding in Brazil. Random regression analysis was used to estimate genetic parameters for the factors faecal egg-count (FEC), packed-cell volume (PCV) and body weight (BW) in Santa Inês lambs. Data from 119 female, offspring of nine rams, were collected between December, 2005 and December, 2006, from the experimental flock of Embrapa Tabuleiros Costeiros, the Brazilian Agricultural Research Corporation located in Frei Paulo, SE, Brazil. After weaning, females were drenched until the faecal egg count had dropped to zero. Two natural challenges were undertaken. FEC heritability was extremely variable, this increasing from 0.04 to 0.27 in the first challenge and from 0.01 to 0.52 during the second. PCV heritability peaks were 0.31 and 0.12 in the first and second challenges, respectively. In the second challenge, BW heritability was close to 0.90. The genetic correlations among these traits did not differ from zero. There is the possibility of increasing parasite resistance in Santa Inês by selecting those animals with lower FEC. Selection to increase resistance will not adversely affect lamb-growth, although lambs with a slow growth-rate may be more susceptible to infection

The QUEST RR Lyrae Survey: Confirmation of the Clump at 50 kpc and Other Over-Densities in the Outer Halo

We have measured the periods and light curves of 148 RR Lyrae variables from V=13.5 to 19.7 from the first 100 sq. degrees of the QUEST RR Lyrae survey. Approximately 55% of these stars belong to the clump of stars detected earlier by the Sloan Digital Sky Survey. According to our measurements, this feature has ~10 times the background density of halo stars, spans at least 37.5 deg by 3.5 deg in right ascension and declination (>=30 by >=3 kpc), lies ~50 kpc from the Sun, and has a depth along the line of sight of ~5 kpc (1 sigma). These properties are consistent with the recent models that suggest it is a tidal stream from the Sgr dSph galaxy. The mean period of the type ab variables, 0.58 d, is also consistent. In addition, we have found two smaller over-densities in the halo, one of which may be related to the globular cluster Pal 5.Comment: 12 pages (including 4 figures). Accepted for publication in the ApJ Letter

Expression and trans-specific polymorphism of self-incompatibility RNases in Coffea (Rubiaceae)

Self-incompatibility (SI) is widespread in the angiosperms, but identifying the biochemical components of SI mechanisms has proven to be difficult in most lineages. Coffea (coffee; Rubiaceae) is a genus of old-world tropical understory trees in which the vast majority of diploid species utilize a mechanism of gametophytic self-incompatibility (GSI). The S-RNase GSI system was one of the first SI mechanisms to be biochemically characterized, and likely represents the ancestral Eudicot condition as evidenced by its functional characterization in both asterid (Solanaceae, Plantaginaceae) and rosid (Rosaceae) lineages. The S-RNase GSI mechanism employs the activity of class III RNase T2 proteins to terminate the growth of "self" pollen tubes. Here, we investigate the mechanism of Coffea GSI and specifically examine the potential for homology to S-RNase GSI by sequencing class III RNase T2 genes in populations of 14 African and Madagascan Coffea species and the closely related self-compatible species Psilanthus ebracteolatus. Phylogenetic analyses of these sequences aligned to a diverse sample of plant RNase T2 genes show that the Coffea genome contains at least three class III RNase T2 genes. Patterns of tissue-specific gene expression identify one of these RNase T2 genes as the putative Coffea S-RNase gene. We show that populations of SI Coffea are remarkably polymorphic for putative S-RNase alleles, and exhibit a persistent pattern of trans-specific polymorphism characteristic of all S-RNase genes previously isolated from GSI Eudicot lineages. We thus conclude that Coffea GSI is most likely homologous to the classic Eudicot S-RNase system, which was retained since the divergence of the Rubiaceae lineage from an ancient SI Eudicot ancestor, nearly 90 million years ago.United States National Science Foundation [0849186]; Society of Systematic Biologists; American Society of Plant Taxonomists; Duke University Graduate Schoolinfo:eu-repo/semantics/publishedVersio

The rapid assembly of an elliptical galaxy of 400 billion solar masses at a redshift of 2.3

Stellar archeology shows that massive elliptical galaxies today formed rapidly about ten billion years ago with star formation rates above several hundreds solar masses per year (M_sun/yr). Their progenitors are likely the sub-millimeter-bright galaxies (SMGs) at redshifts (z) greater than 2. While SMGs' mean molecular gas mass of 5x10^10 M_sun can explain the formation of typical elliptical galaxies, it is inadequate to form ellipticals that already have stellar masses above 2x10^11 M_sun at z ~ 2. Here we report multi-wavelength high-resolution observations of a rare merger of two massive SMGs at z = 2.3. The system is currently forming stars at a tremendous rate of 2,000 M_sun/yr. With a star formation efficiency an order-of-magnitude greater than that of normal galaxies, it will quench the star formation by exhausting the gas reservoir in only ~200 million years. At a projected separation of 19 kiloparsecs, the two massive starbursts are about to merge and form a passive elliptical galaxy with a stellar mass of ~4x10^11 M_sun. Our observations show that gas-rich major galaxy mergers, concurrent with intense star formation, can form the most massive elliptical galaxies by z ~ 1.5.Comment: Appearing in Nature online on May 22 and in print on May 30. Submitted here is the accepted version (including the Supplementary Information), see nature.com for the final versio

Discovery of the Optical Transient of the Gamma Ray Burst 990308

The optical transient of the faint Gamma Ray Burst 990308 was detected by the QUEST camera on the Venezuelan 1-m Schmidt telescope starting 3.28 hours after the burst. Our photometry gives $V = 18.32 \pm 0.07$, $R = 18.14 \pm 0.06$, $B = 18.65 \pm 0.23$, and $R = 18.22 \pm 0.05$ for times ranging from 3.28 to 3.47 hours after the burst. The colors correspond to a spectral slope of close to $f_{\nu} \propto \nu^{1/3}$. Within the standard synchrotron fireball model, this requires that the external medium be less dense than $10^{4} cm^{-3}$, the electrons contain $> 20$ of the shock energy, and the magnetic field energy must be less than 24% of the energy in the electrons for normal interstellar or circumstellar densities. We also report upper limits of $V > 12.0$ at 132 s (with LOTIS), $V > 13.4$ from 132-1029s (with LOTIS), $V > 15.3$ at 28.2 min (with Super-LOTIS), and a 8.5 GHz flux of $< 114 \mu Jy$ at 110 days (with the Very Large Array). WIYN 3.5-m and Keck 10-m telescopes reveal this location to be empty of any host galaxy to $R > 25.7$ and $K > 23.3$. The lack of a host galaxy likely implies that it is either substantially subluminous or more distant than a red shift of $\sim 1.2$.Comment: ApJ Lett submitted, 5 pages, 2 figures, no space for 12 coauthor

Analysing the impact of rescheduling time in hybrid manufacturing control

Hybrid manufacturing control architectures merge the benefits of hierarchical and heterarchical approaches. Disturbances can be handled at upper or lower decision levels, depending on the type of disturbance, its impact and the time the control system has to react. This paper focuses particularly on a disturbance handling mechanism at upper decision levels using a rescheduling manufacturing method. Such rescheduling is more complex that the offline scheduling since the control system must take into account the current system status, obtain a satisfactory performance under the new conditions, and also come up with a new schedule in a restricted amount of time. Then, this paper proposes a simple and generic rescheduling method which, based on the satisfying principle, analyses the trade-off between the rescheduling time and the performance achieved after a perturbation. The proposed approach is validated on a simulation model of a realistic assembly cell and results demonstrate that adaptation of the rescheduling time might be beneficial in terms of overall performance and reactivity.info:eu-repo/semantics/publishedVersio

Sustained epidermal growth factor receptor levels and activation by tethered ligand binding enhances osteogenic differentiation of multi-potent marrow stromal cells

Author Manuscript 2011 April 29.Epidermal growth factor receptor (EGFR)-mediated signaling helps regulate bone development and healing through its effects on osteogenic cells. Here, we show how EGFR activity and osteogenic differentiation responses in primary human bone marrow-derived multipotent stromal cells (MSCs) are influenced by presenting covalently tethered epidermal growth factor (tEGF) on the culture substratum, a presentation mode that reduces EGFR internalization and restricts signaling to the cell surface. In both absence and presence of tEGF, MSCs increase expression levels of EGFR and its heterodimerization partner HER2 during the course of osteogenic differentiation. tEGF substrata increased levels of phosphorylated EGFR and phosphorylated extracellular regulated kinase (ERK) compared to control substrata, and these elevations were associated with a twofold enhancement of MSC alkaline phosphatase activity at day 7 and matrix mineralization at day 21. Surprisingly, addition of soluble EGF (sEGF) to cells cultured on tEGF substrata reduces osteogenic differentiation, even though EGFR signaling is more strongly activated in acute, short-term manner by sEGF treatment than by tEGF treatment. A striking concomitant result of the sEGF effects is near-complete downregulation of EGFR and HER2, demonstrating that the tEGF/EGFR interaction is dynamically reversible even though temporally sustained. Taken together, our results show that enhanced MSC osteogenic differentiation corresponds to a sustained combination of receptor expression and ligand presentation, both of which are maintained by tEGF.National Institutes of Health (U.S.) (Grant R01-GM059870-07)National Institutes of Health (U.S.) (Grant R01-DE 019523-10)National Institutes of Health (U.S.) (Grant P40RR017447)United Negro College Fund (Merck Postdoctoral Fellowship)Georgia Institute of Technology (FACES Fellowship)National Center for Research Resources (U.S.) (Grant P40RR017447

Flow shop rescheduling under different types of disruption

This is an Accepted Manuscript of an article published by Taylor & Francis in International Journal of Production Research on 2013, available online:http://www.tandfonline.com/10.1080/00207543.2012.666856Almost all manufacturing facilities need to use production planning and scheduling systems to increase productivity and to reduce production costs. Real-life production operations are subject to a large number of unexpected disruptions that may invalidate the original schedules. In these cases, rescheduling is essential to minimise the impact on the performance of the system. In this work we consider flow shop layouts that have seldom been studied in the rescheduling literature. We generate and employ three types of disruption that interrupt the original schedules simultaneously. We develop rescheduling algorithms to finally accomplish the twofold objective of establishing a standard framework on the one hand, and proposing rescheduling methods that seek a good trade-off between schedule quality and stability on the other.The authors would like to thank the anonymous referees for their careful and detailed comments that helped to improve the paper considerably. This work is partially financed by the Small and Medium Industry of the Generalitat Valenciana (IMPIVA) and by the European Union through the European Regional Development Fund (FEDER) inside the R + D program "Ayudas dirigidas a Institutos tecnologicos de la Red IMPIVA" during the year 2011, with project number IMDEEA/2011/142.Katragjini Prifti, K.; Vallada Regalado, E.; Ruiz García, R. (2013). Flow shop rescheduling under different types of disruption. International Journal of Production Research. 51(3):780-797. https://doi.org/10.1080/00207543.2012.666856S780797513Abumaizar, R. J., & Svestka, J. A. (1997). Rescheduling job shops under random disruptions. International Journal of Production Research, 35(7), 2065-2082. doi:10.1080/002075497195074Adiri, I., Frostig, E., & Kan, A. H. G. R. (1991). Scheduling on a single machine with a single breakdown to minimize stochastically the number of tardy jobs. Naval Research Logistics, 38(2), 261-271. doi:10.1002/1520-6750(199104)38:23.0.co;2-iAkturk, M. S., & Gorgulu, E. (1999). Match-up scheduling under a machine breakdown. European Journal of Operational Research, 112(1), 81-97. doi:10.1016/s0377-2217(97)00396-2Allahverdi, A. (1996). Two-machine proportionate flowshop scheduling with breakdowns to minimize maximum lateness. Computers & Operations Research, 23(10), 909-916. doi:10.1016/0305-0548(96)00012-3Arnaout, J. P., & Rabadi, G. (2008). Rescheduling of unrelated parallel machines under machine breakdowns. International Journal of Applied Management Science, 1(1), 75. doi:10.1504/ijams.2008.020040Artigues, C., Billaut, J.-C., & Esswein, C. (2005). Maximization of solution flexibility for robust shop scheduling. European Journal of Operational Research, 165(2), 314-328. doi:10.1016/j.ejor.2004.04.004Azizoglu, M., & Alagöz, O. (2005). Parallel-machine rescheduling with machine disruptions. IIE Transactions, 37(12), 1113-1118. doi:10.1080/07408170500288133Bean, J. C., Birge, J. R., Mittenthal, J., & Noon, C. E. (1991). Matchup Scheduling with Multiple Resources, Release Dates and Disruptions. Operations Research, 39(3), 470-483. doi:10.1287/opre.39.3.470Caricato, P., & Grieco, A. (2008). An online approach to dynamic rescheduling for production planning applications. International Journal of Production Research, 46(16), 4597-4617. doi:10.1080/00207540601136225CHURCH, L. K., & UZSOY, R. (1992). Analysis of periodic and event-driven rescheduling policies in dynamic shops. International Journal of Computer Integrated Manufacturing, 5(3), 153-163. doi:10.1080/09511929208944524Cowling, P., & Johansson, M. (2002). Using real time information for effective dynamic scheduling. European Journal of Operational Research, 139(2), 230-244. doi:10.1016/s0377-2217(01)00355-1Curry, J., & Peters *, B. (2005). Rescheduling parallel machines with stepwise increasing tardiness and machine assignment stability objectives. International Journal of Production Research, 43(15), 3231-3246. doi:10.1080/00207540500103953DUTTA, A. (1990). Reacting to Scheduling Exceptions in FMS Environments. IIE Transactions, 22(4), 300-314. doi:10.1080/07408179008964185Ghezail, F., Pierreval, H., & Hajri-Gabouj, S. (2010). Analysis of robustness in proactive scheduling: A graphical approach. Computers & Industrial Engineering, 58(2), 193-198. doi:10.1016/j.cie.2009.03.004Goren, S., & Sabuncuoglu, I. (2008). Robustness and stability measures for scheduling: single-machine environment. IIE Transactions, 40(1), 66-83. doi:10.1080/07408170701283198Hall, N. G., & Potts, C. N. (2004). Rescheduling for New Orders. Operations Research, 52(3), 440-453. doi:10.1287/opre.1030.0101Herrmann, J. W., Lee, C.-Y., & Snowdon, J. L. (1993). A Classification of Static Scheduling Problems. Complexity in Numerical Optimization, 203-253. doi:10.1142/9789814354363_0011Herroelen, W., & Leus, R. (2005). Project scheduling under uncertainty: Survey and research potentials. European Journal of Operational Research, 165(2), 289-306. doi:10.1016/j.ejor.2004.04.002Hozak, K., & Hill, J. A. (2009). Issues and opportunities regarding replanning and rescheduling frequencies. International Journal of Production Research, 47(18), 4955-4970. doi:10.1080/00207540802047106Huaccho Huatuco, L., Efstathiou, J., Calinescu, A., Sivadasan, S., & Kariuki, S. (2009). Comparing the impact of different rescheduling strategies on the entropic-related complexity of manufacturing systems. International Journal of Production Research, 47(15), 4305-4325. doi:10.1080/00207540701871036Jensen, M. T. (2003). Generating robust and flexible job shop schedules using genetic algorithms. IEEE Transactions on Evolutionary Computation, 7(3), 275-288. doi:10.1109/tevc.2003.810067King, J. R. (1976). The theory-practice gap in job-shop scheduling. Production Engineer, 55(3), 137. doi:10.1049/tpe.1976.0044Kopanos, G. M., Capón-García, E., Espuña,, A., & Puigjaner, L. (2008). Costs for Rescheduling Actions: A Critical Issue for Reducing the Gap between Scheduling Theory and Practice. Industrial & Engineering Chemistry Research, 47(22), 8785-8795. doi:10.1021/ie8005676Lee, C.-Y., Leung, J. Y.-T., & Yu, G. (2006). Two Machine Scheduling under Disruptions with Transportation Considerations. Journal of Scheduling, 9(1), 35-48. doi:10.1007/s10951-006-5592-7Li, Z., & Ierapetritou, M. (2008). Process scheduling under uncertainty: Review and challenges. Computers & Chemical Engineering, 32(4-5), 715-727. doi:10.1016/j.compchemeng.2007.03.001Liao, C. J., & Chen, W. J. (2004). Scheduling under machine breakdown in a continuous process industry. Computers & Operations Research, 31(3), 415-428. doi:10.1016/s0305-0548(02)00224-1Mehta, S. V. (1999). Predictable scheduling of a single machine subject to breakdowns. International Journal of Computer Integrated Manufacturing, 12(1), 15-38. doi:10.1080/095119299130443MUHLEMANN, A. P., LOCKETT, A. G., & FARN, C.-K. (1982). Job shop scheduling heuristics and frequency of scheduling. International Journal of Production Research, 20(2), 227-241. doi:10.1080/00207548208947763Nawaz, M., Enscore, E. E., & Ham, I. (1983). A heuristic algorithm for the m-machine, n-job flow-shop sequencing problem. Omega, 11(1), 91-95. doi:10.1016/0305-0483(83)90088-9O’Donovan, R., Uzsoy, R., & McKay, K. N. (1999). Predictable scheduling of a single machine with breakdowns and sensitive jobs. International Journal of Production Research, 37(18), 4217-4233. doi:10.1080/002075499189745Özlen, M., & Azizoğlu, M. (2009). Generating all efficient solutions of a rescheduling problem on unrelated parallel machines. International Journal of Production Research, 47(19), 5245-5270. doi:10.1080/00207540802043998Pfeiffer, A., Kádár, B., & Monostori, L. (2007). Stability-oriented evaluation of rescheduling strategies, by using simulation. Computers in Industry, 58(7), 630-643. doi:10.1016/j.compind.2007.05.009Pierreval, H., & Durieux-Paris, S. (2007). Robust simulation with a base environmental scenario. European Journal of Operational Research, 182(2), 783-793. doi:10.1016/j.ejor.2006.07.045Damodaran, P., Hirani, N. S., & Gallego, M. C. V. (2009). Scheduling identical parallel batch processing machines to minimise makespan using genetic algorithms. European J. of Industrial Engineering, 3(2), 187. doi:10.1504/ejie.2009.023605Qi, X., Bard, J. F., & Yu, G. (2006). Disruption management for machine scheduling: The case of SPT schedules. International Journal of Production Economics, 103(1), 166-184. doi:10.1016/j.ijpe.2005.05.021Rangsaritratsamee, R., Ferrell, W. G., & Kurz, M. B. (2004). Dynamic rescheduling that simultaneously considers efficiency and stability. Computers & Industrial Engineering, 46(1), 1-15. doi:10.1016/j.cie.2003.09.007Ruiz, R., & Stützle, T. (2007). A simple and effective iterated greedy algorithm for the permutation flowshop scheduling problem. European Journal of Operational Research, 177(3), 2033-2049. doi:10.1016/j.ejor.2005.12.009Sabuncuoglu, I., & Goren, S. (2009). Hedging production schedules against uncertainty in manufacturing environment with a review of robustness and stability research. International Journal of Computer Integrated Manufacturing, 22(2), 138-157. doi:10.1080/09511920802209033Sabuncuoglu, I., & Kizilisik, O. B. (2003). Reactive scheduling in a dynamic and stochastic FMS environment. International Journal of Production Research, 41(17), 4211-4231. doi:10.1080/0020754031000149202Salveson, M. E. (1952). On a Quantitative Method in Production Planning and Scheduling. Econometrica, 20(4), 554. doi:10.2307/1907643Samarghandi, H., & ElMekkawy, T. Y. (2011). An efficient hybrid algorithm for the two-machine no-wait flow shop problem with separable setup times and single server. European J. of Industrial Engineering, 5(2), 111. doi:10.1504/ejie.2011.039869Subramaniam *, V., Raheja, A. S., & Rama Bhupal Reddy, K. (2005). Reactive repair tool for job shop schedules. International Journal of Production Research, 43(1), 1-23. doi:10.1080/0020754042000270412Taillard, E. (1990). Some efficient heuristic methods for the flow shop sequencing problem. European Journal of Operational Research, 47(1), 65-74. doi:10.1016/0377-2217(90)90090-xTaillard, E. (1993). Benchmarks for basic scheduling problems. European Journal of Operational Research, 64(2), 278-285. doi:10.1016/0377-2217(93)90182-mValente, J. M. S., & Schaller, J. E. (2010). Improved heuristics for the single machine scheduling problem with linear early and quadratic tardy penalties. European J. of Industrial Engineering, 4(1), 99. doi:10.1504/ejie.2010.029572Vallada, E., & Ruiz, R. (2010). Genetic algorithms with path relinking for the minimum tardiness permutation flowshop problem☆. Omega, 38(1-2), 57-67. doi:10.1016/j.omega.2009.04.002Vieira, G. E., Herrmann, J. W., & Lin, E. (2000). Predicting the performance of rescheduling strategies for parallel machine systems. Journal of Manufacturing Systems, 19(4), 256-266. doi:10.1016/s0278-6125(01)80005-4Vieira, G. E., Herrmann, J. W., & Lin, E. (2003). Journal of Scheduling, 6(1), 39-62. doi:10.1023/a:1022235519958Yang, J., & Yu, G. (2002). Journal of Combinatorial Optimization, 6(1), 17-33. doi:10.1023/a:1013333232691Zandieh, M., & Gholami, M. (2009). An immune algorithm for scheduling a hybrid flow shop with sequence-dependent setup times and machines with random breakdowns. International Journal of Production Research, 47(24), 6999-7027. doi:10.1080/0020754080240063